Approximating k-Spanner Problems for k>2
نویسندگان
چکیده
Given a graph G = (V ,E), a subgraph G′ = (V ,H), H ⊆ E is a k-spanner of G if for any pair of vertices u,w ∈ V it satisfies dH (u,w) kdG(u,w). The basic k-spanner problem is to find a k-spanner of a given graph G with the smallest possible number of edges. This paper considers approximation algorithms for this and some related problems for k > 2, known to be (2log 1− n)inapproximable. The basic k-spanner problem over undirected graphs with k > 2 has been given a sublinear ratio approximation algorithm (with ratio roughly O(n2/(k+1))), but no such algorithms were known for other variants of the problem, including the directed and the client–server variants, as well as for the related k-DSS problem. We present the first approximation algorithms for these problems with sublinear approximation ratio. The second contribution of this paper is in characterizing some wide families of graphs on which the problems do admit a logarithmic and a polylogarithmic approximation ratios. These families are characterized as containing graphs that have optimal or “near-optimal” spanners with certain desirable properties, such as being a tree, having low arboricity or having low girth. All our results generalize to the directed and the client–server variants of the problems. As a simple corollary, we present an algorithm that given a graph G builds a subgraph with Õ(n) edges and stretch bounded by the tree-stretch of G, namely the minimum maximal stretch of a spanning tree for G. The analysis of our algorithms involves the novel notion of edge-dominating systems developed in the paper. The technique introduced in the paper reduces the studied algorithmic approximability ∗ Corresponding author. E-mail addresses: [email protected] (M. Elkin), [email protected] (D. Peleg). 1 Supported in part by grants from the Israel Science Foundation and the Israel Ministry of Science and Art. 0304-3975/$ see front matter © 2005 Elsevier B.V. All rights reserved. doi:10.1016/j.tcs.2004.11.022 250 M. Elkin, D. Peleg / Theoretical Computer Science 337 (2005) 249–277 questions on k-spanners to purely graph-theoretical questions concerning the existence of certain combinatorial objects in families of graphs. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Hardness of approximating the undirected minimum size k-spanner
In the undirected unweighted minimum size k-spanner problem we are given a graph with edges of cost and length 1, and a number k. The goal is to find a minimum size E′ and a graph G′(V,E′) so that for every u, v ∈ V : distG(u, v) distG′(u, v) ≤ k. In [2], a conditional hardness was given to the problem, based on the conjecture that there is an instance of MIN −REPk that is as hard to approximat...
متن کاملTree Spanners for Subgraphs and Related Tree Covering Problems
For any fixed parameter k ≥ 1, a tree k–spanner of a graph G is a spanning tree T in G such that the distance between every pair of vertices in T is at most k times their distance in G. In this paper, we generalize on this very restrictive concept, and introduce Steiner tree k–spanners: We are given an input graph consisting of terminals and Steiner vertices, and we are now looking for a tree k...
متن کاملMin-Rep instances with large supergirth and the hardness of approximating basic spanners
We study the Min-rep with large supergirth problem. We show that if the supergirth in the Min-Rep graph is some k, 0 < k ≤ log1−2ǫ n, the problem is roughly 2log 1−ǫ n/k hard to approximate. A similar theorem was claimed by the paper [19] from ICALP 2000. However their paper contains an error. We use the new proof to show inapproximability for the min-size k-spanner problem which is the simples...
متن کاملLowest Degree k-Spanner: Approximation and Hardness
A k-spanner is a subgraph in which distances are approximately preserved, up to some given stretch factor k. We focus on the following problem: Given a graph and a value k, can we find a k-spanner that minimizes the maximum degree? While reasonably strong bounds are known for some spanner problems, they almost all involve minimizing the total number of edges. Switching the objective to the degr...
متن کاملFinding Sparser Directed Spanners
A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V,EH) is a k-spanner of a graph G = (V,E) if for every pair of vertices u, v ∈ V , the shortest path distance distH(u, v) from u to v in H is at most k · distG(u, v). We focus on spanners of directed graphs and a related notion of transitiveclosure spanners. Th...
متن کامل